Model checking with probabilistic tabled logic programming
نویسندگان
چکیده
منابع مشابه
Model checking with probabilistic tabled logic programming
We present a formulation of the problem of probabilistic model checking as one of query evaluation over probabilistic logic programs. To the best of our knowledge, our formulation is the first of its kind, and it covers a rich class of probabilistic models and probabilistic temporal logics. The inference algorithms of existing probabilistic logic-programming systems are well defined only for qu...
متن کاملModel Checking with Tabled Logic Programming∗
This article presents a tutorial overview of using Tabled Logic Programming for model checking finite-state systems. In this article, we mainly focus on the work done by the LMC group in Stony Brook, pointing out the relevant related works along the way. We describe a complete model checkers for the computation tree logic (CTL), the modal mu-calculus, the linear temporal logic (LTL) and a value...
متن کاملXSB: Extending Prolog with Tabled Logic Programming
The paradigm of Tabled Logic Programming (TLP) is now supported by a number of Prolog systems, including XSB, YAP Prolog, B-Prolog, Mercury, ALS, and Ciao. The reasons for this are partly theoretical: tabling ensures termination and optimal known complexity for queries to a large class of programs. However the overriding reasons are practical. TLP allows sophisticated programs to be written con...
متن کاملAbductive Logic Programming with Tabled Abduction
In abductive logic programming, abductive solutions are typically computed without attending to the abductive context. These abductive solutions can actually be reused in a different abductive context. In this paper, we employ a tabling mechanism and propose a tabled abduction mechanism, that consists of a transformation from abductive normal logic programs into tabled dual programs, by tabling...
متن کاملEfficient Real-Time Model Checking Using Tabled Logic Programming and Constraints
Logic programming based tools for real-time model checking are beginning to emerge. In a previous work we had demonstrated the feasibility of building such a model checker by combining constraint processing and tabulation. But eÆciency and practicality of such a model checker were not adequately addressed. In this paper we describe XMC/dbm, an eÆcient model checker for real-time systems using t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory and Practice of Logic Programming
سال: 2012
ISSN: 1471-0684,1475-3081
DOI: 10.1017/s1471068412000245